Large Scale Reasoning Using Allen's Interval Algebra

نویسندگان

  • Matthew Mantle
  • Sotiris Batsakis
  • Grigoris Antoniou
چکیده

This paper proposes and evaluates a distributed, parallel approach for reasoning over large scale datasets using Allen’s Interval Algebra (IA). We have developed and implemented algorithms that reason over IA networks using the Spark distributed processing framework. Experiments have been conducted by deploying the algorithms on computer clusters using synthetic datasets with various characteristics. We show that reasoning over datasets consisting of millions of interval relations is feasible and that our implementation scales effectively. The size of the IA networks we are able to reason over is far greater than those found in previously published works.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Eight Maximal Tractable Subclasses of Allen's Algebra with Metric Time

This paper combines two important directions of research in temporal reson-ing: that of nding maximal tractable subclasses of Allen's interval algebra, and that of reasoning with metric temporal information. Eight new maximal tractable subclasses of Allen's interval algebra are presented, some of them subsuming previously reported tractable algebras. The algebras allow for metric temporal const...

متن کامل

Short Paper: Semantic Sensor Composition

This paper describes an application of semantics to sensors to automatically create sensor compositions. Two main contributions of this paper are a sensor ontology and a composition system. The OWL ontology describes user goals, functional and non-functional properties of sensors and sensor composition, while the Region Connection Calculus and Allen’s Interval Algebra are used for describing th...

متن کامل

Eight Maximal Tractable Subclasses of Allen ' s

This paper combines two important directions of research in temporal resoning: that of nding maximal tractable subclasses of Allen's interval algebra, and that of reasoning with metric temporal information. Eight new maximal tractable subclasses of Allen's interval algebra are presented, some of them subsuming previously reported tractable algebras. The algebras allow for metric temporal constr...

متن کامل

Reasoning about Temporal Relations : A Maximal Tractable Subclassof

We introduce a new subclass of Allen's interval algebra we call \ORD-Horn subclass," which is a strict superset of the \pointisable subclass." We prove that reasoning in the ORD-Horn subclass is a polynomial-time problem and show that the path-consistency method is suucient for deciding satissability. Further, using an extensive machine-generated case analysis, we show that the ORD-Horn subclas...

متن کامل

Reasoning with Multi-Point Events

Recent research on qualitative reasoning has focussed on representing and reasoning about events that occur repeatedly. Allen's interval algebra has been modiied to model events that are collections of convex intervals|a non-convex interval. Using the modiied version of Allen's algebra, constraint-based algorithms have been investigated for nding feasible relations in a network of non-convex in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016